Gromov–Hausdorff stability of linkage-based hierarchical clustering methods
نویسندگان
چکیده
منابع مشابه
Gromov-Hausdorff stability of linkage-based hierarchical clustering methods
A hierarchical clustering method is stable if small perturbations on the data set produce small perturbations in the result. This perturbations are measured using the Gromov-Hausdorff metric. We study the problem of stability on linkage-based hierarchical clustering methods. We obtain that, under some basic conditions, standard linkage-based methods are semi-stable. This means that they are sta...
متن کاملDiscerning Linkage-Based Algorithms among Hierarchical Clustering Methods
Selecting a clustering algorithm is a perplexing task. Yet since different algorithms may yield dramatically different outputs on the same data, the choice of algorithm is crucial. When selecting a clustering algorithm, users tend to focus on cost-related considerations (software purchasing costs, running times, etc). Differences concerning the output of the algorithms are not usually considere...
متن کاملA Characterization of Linkage-Based Hierarchical Clustering
The class of linkage-based algorithms is perhaps the most popular class of hierarchical algorithms. We identify two properties of hierarchical algorithms, and prove that linkagebased algorithms are the only ones that satisfy both of these properties. Our characterization clearly delineates the difference between linkage-based algorithms and other hierarchical methods. We formulate an intuitive ...
متن کاملPoisoning Complete-Linkage Hierarchical Clustering
Clustering algorithms are largely adopted in security applications as a vehicle to detect malicious activities, although few attention has been paid on preventing deliberate attacks from subverting the clustering process itself. Recent work has introduced a methodology for the security analysis of data clustering in adversarial settings, aimed to identify potential attacks against clustering al...
متن کاملCharacterization, Stability and Convergence of Hierarchical Clustering Methods
We study hierarchical clustering schemes under an axiomatic view. We show that within this framework, one can prove a theorem analogous to one of Kleinberg (2002), in which one obtains an existence and uniqueness theorem instead of a non-existence result. We explore further properties of this unique scheme: stability and convergence are established. We represent dendrograms as ultrametric space...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2015
ISSN: 0001-8708
DOI: 10.1016/j.aim.2015.03.018